The successive sweep method and dynamic programming
نویسندگان
چکیده
منابع مشابه
The Successive Backward Sweep Method for Optimal Control of Nonlinear Systems with Constraints
This paper presents variations of the Successive Backward Sweep (SBS) method for solving nonlinear problems involving terminal and control constraints. The suggested SBS method is based on the linear quadratic control methodology and is relatively insensitive to the initial guesses of the state and control histories. The overall procedure of this method is similar to the existing neighboring ex...
متن کاملSolution of a Dynamic Programming Model using Caratheodory Successive Approximation Method
A functional equation in dynamic programming is developed using multistage allocation processs. The existence of the solution of this equation is proved using caratheodory successive approximation process. Uniqueness of the solution is established.
متن کاملPath Planning for Mobile Robot with Half-sweep Successive Over- Relaxation (hssor) Iterative Method
This paper describes our work in solving path planning problem for mobile robot by using harmonic functions to generate path in the configuration space. Harmonic functions are known to have an advantage as a global potential function in the potential field based approach for robot path planning. However, an immense amount of computations are required as the size of the environment get bigger. T...
متن کاملThe corridor method : a dynamic programming inspired
This paper presents a dynamic programming inspired metaheuristic called Corridor Method. It can be classified as a method-based iterated local search in that it deploys method-based neighborhoods. By this we mean that the search for a new candidate solution is carried out by a fully-fledged optimization method and generates a global optimal solution over the neighborhood. The neighborhoods are ...
متن کاملOn Optimizing the Sweep-Line Method
For applying the sweep-line method, a state space reduction technique, it is necessary to provide an automatic calculation of a progress measure. In [1], such a calculation has been proposed for Petri nets. The approach presented there may lead to suboptimal results, therefore the author suggested possible optimizations. In this paper, we check whether the proposed optimization goals indeed lea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1967
ISSN: 0022-247X
DOI: 10.1016/0022-247x(67)90012-1